Faultfree Tromino Tilings of Rectangles
نویسندگان
چکیده
In this paper we consider faultfree tromino tilings of rectangles and characterize rectangles that admit such tilings. We introduce the notion of crossing numbers for tilings and derive bounds on the crossing numbers of faultfree tilings. We develop an iterative scheme for generating faultfree tromino tilings for rectangles and derive the closed form expression for the exact number of faultfree tromino tilings for 4 × 3t rectangles and the exact generating function for 5 × 3t rectangles, t ≥ 1. Our iterative scheme generalizes to arbitrary rectangles; for 6 × 6t and 7 × 6t rectangles, t ≥ 1, we derive generating functions for estimating lower bounds on the number of faultfree tilings. We also derive an upper bound on the number of tromino tilings of an m × n rectangle, where 3|mn and m,n > 0.
منابع مشابه
Some Polyomino Tilings of the Plane
We calculate the generating functions for the number of tilings of rectangles of various widths by the right tromino, the L tetromino, and the T tetromino. This allows us to place lower bounds on the entropy of tilings of the plane by each of these. For the T tetromino, we also derive a lower bound from the solution of the Ising model in two dimensions.
متن کاملParity and tiling by trominoes
The problem of counting tilings by dominoes and other dimers and finding arithmetic significance in these numbers has received considerable attention. In contrast, little attention has been paid to the number of tilings by more complex shapes. In this paper, we consider tilings by trominoes and the parity of the number of tilings. We mostly consider reptilings and tilings of related shapes by t...
متن کاملTromino tilings of domino-deficient rectangles
In this paper I have settled the open problem, posed by J. Marshall Ash and S. Golomb in [4], of tiling an m × n rectangle with L-shaped trominoes, with the condition that 3 |(mn 2) and a domino is removed from the given rectangle. It turns out that for any given m, n ≥ 7, the only pairs of squares which prevent a tiling are {(1,2), (2,2)}, {(2,1), (2,2)}, {(2,3), (2,4)}, {(3,2), (4,2)} and the...
متن کاملHard and Easy Instances of L-Tromino Tilings
In this work we study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, nonetheless, we indentify restrictions to the problem where either it remains NP-complete or it has a polynomial time algorithm. First we show that an aztec diamond of order n always has an L-tromino tiling...
متن کاملOn Tilings of Quadrants and Rectangles and Rectangular Pattern
The problem of tiling rectangles by polyominoes generated large interest. A related one is the problem of tiling parallelograms by twisted polyominoes. Both problems are related with tilings of (skewed) quadrants by polyominoes. Indeed, if all tilings of a (skewed) quadrant by a tile set can be reduced to a tiling by congruent rectangles (parallelograms), this provides information about tilings...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006